COUNTEREXAMPLES TO A CONJECTURE ON BOUNDS FOR THE LOSS PROBABILITY IN FINITE-BUFFER QUEUES
نویسندگان
چکیده
منابع مشابه
Comparison of two approximations for the loss probability in finite-buffer queues
This note deals with two related approximations that were recently proposed for the loss probability in finite-buffer queues. The purpose of the paper is two-fold. First, to provide better insight and more theoretical support for both approximations. Second, to show by an experimental study how well both approximations perform. An interesting empirical finding is that in many cases of practical...
متن کاملOn counterexamples to the Hughes conjecture
In 1957 D.R. Hughes published the following problem in group theory. Let G be a group and p a prime. Define Hp(G) to be the subgroup of G generated by all the elements of G which do not have order p . Is the following conjecture true: either Hp(G) = 1, Hp(G) = G , or [G : Hp(G)] = p? This conjecture has become known as the Hughes conjecture. After various classes of groups were shown to satisfy...
متن کاملA Counterexample to Fishburn’s Conjecture on Finite Linear Qualitative Probability
Kraft, Pratt and Seidenberg (1959) provided an infinite set of axioms which, when taken together with de Finetti’s axiom, gives a necessary and sufficient set of “cancellation” conditions for representability of an ordering relation on subsets of a set by an order-preserving probability measure. Fishburn (1996) defined f(n) to be the smallest positive integer k such that every comparative proba...
متن کاملCounterexamples to the uniformity conjecture
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, part of an attempt to solve this problem, postulates a simple linear relationship between the syntactic length of expressions built up from the natural numbers using field operations, radicals and exponentials and loga...
متن کاملLoss Probability for a Finite Buffer Multiplexer with the M/G/infinity Input Process
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of a network multiplexer. The network multiplexer is characterized by a multiplexing queue with a finite buffer and an M/G/∞ input process. Our analysis expresses the loss probability bounds using a simple relationship between loss probability and buffer full probability. Our analysis also derives an exact ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 1999
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s026996489913208x